Positive speed self-avoiding walks on graphs with more than one end
نویسندگان
چکیده
منابع مشابه
Self-Avoiding Walks with Writhe
We map self-avoiding random walks with a chemical potential for writhe to the three-dimensional complex O(N) Chern-Simons theory as N → 0. We argue that at the Wilson-Fisher fixed point which characterizes normal selfavoiding walks (with radius of gyration exponent ν ≈ 0.588) a small chemical potential for writhe is irrelevant and the Chern-Simons field does not modify the monomer-monomer corre...
متن کاملAnisotropic Self - Avoiding Walks
We consider a model of self-avoiding walks on the lattice Zd with different weights for steps in each of the 2d lattice directions. We find that the directiondependent mass for the two-point function of this model has three phases: mass positive in all directions; mass identically −∞; and masses of different signs in different directions. The final possibility can only occur if the weights are ...
متن کاملPrudent Self-Avoiding Walks
We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating function is almost certainly not differentiably-finite.
متن کاملExtendable Self-avoiding Walks
The connective constant μ of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be extended forwards (respectively, backwards) to a singly infinite self-avoiding walk. It is called doubly extendable if it may be extended in both directions simultan...
متن کاملCounting Self-avoiding Walks
The connective constant μ(G) of a graph G is the asymptotic growth rate of the number of self-avoiding walks on G from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying graph G. Firstly, when G is cubic, we study the effect on μ(G) of the Fisher transformation (that is, the replacement of vertices by triangles). Secondly, we discuss ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2020
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2020.105257